Language Splitting and Relevance-Based Belief Change in Horn Logic
نویسندگان
چکیده
This paper presents a framework for relevance-based belief change in propositional Horn logic. We firstly establish a parallel interpolation theorem for Horn logic and show that Parikh’s Finest Splitting Theorem holds with Horn formulae. By reformulating Parikh’s relevance criterion in the setting of Horn belief change, we construct a relevance-based partial meet Horn contraction operator and provide a representation theorem for the operator. Interestingly, we find that this contraction operator can be fully characterised by Delgrande and Wassermann’s postulates for partial meet Horn contraction as well as Parikh’s relevance postulate without requiring any change on the postulates, which is qualitatively different from the case in classical propositional logic.
منابع مشابه
Belief revision in Horn theories
This paper investigates belief revision where the underlying logic is that governing Horn clauses. We show that classical (AGM) belief revision doesn’t immediately generalise to the Horn case. In particular, a standard construction based on a total preorder over possible worlds may violate the accepted (AGM) postulates. Conversely, in the obvious extension to the AGM approach, Horn revision fun...
متن کاملParallel interpolation, splitting, and relevance in belief change
The splitting theorem says that any set of formulae has a finest representation as a family of letter-disjoint sets. Parikh formulated this for classical propositional logic, proved it in the finite case, used it to formulate a criterion for relevance in belief change, and showed that AGM partial meet revision can fail the criterion. In this paper we make three further contributions. We begin b...
متن کاملHorn Clause Contraction Functions: Belief Set and Belief Base Approaches
Standard approachs to belief change assume that the underlying logic contains classical propositional logic. Recently there has been interest in investigating approaches to belief change, specifically contraction, in which the underlying logic is not as expressive as full propositional logic. In this paper we consider approaches to belief contraction in Horn knowledge bases. We develop two broa...
متن کاملOn the Link between Partial Meet, Kernel, and Infra Contraction and its Application to Horn Logic
Standard belief change assumes an underlying logic containing full classical propositional logic. However, there are good reasons for considering belief change in less expressive logics as well. In this paper we build on recent investigations by Delgrande on contraction for Horn logic. We show that the standard basic form of contraction, partial meet, is too strong in the Horn case. This result...
متن کاملHorn Clause Contraction Functions
In classical, AGM-style belief change, it is assumed that the underlying logic contains classical propositional logic. This is clearly a limiting assumption, particularly in Artificial Intelligence. Consequently there has been recent interest in studying belief change in approaches where the full expressivity of classical propositional logic is not obtained. In this paper we investigate belief ...
متن کامل